Task I.a.1 -selection of Basic Software Tools for Standard and Generalized State-space Systems and Transfer Matrix Factorizations 1
نویسنده
چکیده
منابع مشابه
SLICOT Working Note 1999-17 Task I.A - Basic Software Tools for Standard and Generalized State-space Systems and Transfer Matrix Factorizations
This report surveys the deliverables of Task I.A. We first give a brief description of the control problems that are solved by the basic numerical tools developed in this Task and we list the different routines of SLICOT that correspond to these control problems and that are available via ftp. We then describe the toolboxes that give interactive access via Matlab or Scilab to those routines and...
متن کاملMental Arithmetic Task Recognition Using Effective Connectivity and Hierarchical Feature Selection From EEG Signals
Introduction: Mental arithmetic analysis based on Electroencephalogram (EEG) signal for monitoring the state of the user’s brain functioning can be helpful for understanding some psychological disorders such as attention deficit hyperactivity disorder, autism spectrum disorder, or dyscalculia where the difficulty in learning or understanding the arithmetic exists. Most mental arithmetic recogni...
متن کاملComputation of Normalized Coprime Factorizations of Rational Matrices
We propose a new computational approach based on descriptor state space algorithms for computing normalized coprime factorizations of arbitrary rational matrices. The proposed approach applies to both continuousand discrete-time rational transfer-function matrices and shows that each rational matrix possesses a normalized coprime factorization with proper factors. The new method is conceptually...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملGeneralized Schur Methods to Computecoprime Factorizations of Rational Matricesa
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices: 1) factorizations with least order denominators; 2) factorizations with inner denominators; and 3) factorizations with proper stable factors. The new algorithms are based on a recursive generalized Schur algorithm for pole assignment. They are generally applic...
متن کامل